Termination w.r.t. Q proof of TRS/SK902.53.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

G₂(h₁(x), y) -> G₂(x, y)
F₂(x, y) -> G₂(x, y)
G₂(h₁(x), y) -> F₂(x, y)

The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

G₂(h₁(x), y) -> G₂(x, y)
F₂(x, y) -> G₂(x, y)
G₂(h₁(x), y) -> F₂(x, y)

The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

G₂(h₁(x), y) -> G₂(x, y)
G₂(h₁(x), y) -> F₂(x, y)

The remaining pairs can at least be oriented weakly.

F₂(x, y) -> G₂(x, y)

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( G₂(x₁, x₂) ) = max{0, x₁ - 1}

POL( h₁(x₁) ) = x₁ + 2

POL( F₂(x₁, x₂) ) = max{0, x₁ - 1}

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₂(x, y) -> G₂(x, y)

The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.